Parametric solutions to Sylvester-conjugate matrix equations
نویسندگان
چکیده
منابع مشابه
Accurate solutions of M-matrix Sylvester equations
This paper is concerned with a relative perturbation theory and its entrywise relatively accurate numerical solutions of an M -matrix Sylvester equation AX + XB = C by which we mean both A and B have positive diagonal entries and nonpositive off-diagonal entries and P = Im⊗A+B⊗ In is a nonsingular M -matrix, and C is entrywise nonnegative. It is proved that small relative perturbations to the e...
متن کاملFinite iterative algorithms for extended Sylvester-conjugate matrix equations
An iterative algorithm is presented for solving the extended Sylvester-conjugate matrix equation. By this iterativemethod, the solvability of thematrix equation can be determined automatically. When the matrix equation is consistent, a solution can be obtained within finite iteration steps for any initial values in the absence of round-off errors. The algorithm is also generalized to solve a mo...
متن کاملIterative least-squares solutions of coupled Sylvester matrix equations
In this paper, we present a general family of iterative methods to solve linear equations, which includes the well-known Jacobi and Gauss–Seidel iterations as its special cases. The methods are extended to solve coupled Sylvester matrix equations. In our approach, we regard the unknown matrices to be solved as the system parameters to be identified, and propose a least-squares iterative algorit...
متن کاملParametric solutions to the generalized discrete Sylvester matrix equation MXN - X = TY and their applications
In this paper, an explicit, analytical and complete solution to the generalized discrete Sylvester matrix equation M X N − X = T Y which is closely related with several types of matrix equations in control theory is obtained. The proposed solution has a neat and elegant form in terms of the Krylov matrix, a block Hankel matrix and an observability matrix. Based on the proposed solution, an expl...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.08.034